Proof complexity

Results: 225



#Item
51Truth vs. Proof in Computational Complexity Boaz Barak∗ September 24, 2012 Theoretical Computer Science is blessed (or cursed?) with many open problems. For some of these questions, such as the P vs N P problem, it see

Truth vs. Proof in Computational Complexity Boaz Barak∗ September 24, 2012 Theoretical Computer Science is blessed (or cursed?) with many open problems. For some of these questions, such as the P vs N P problem, it see

Add to Reading List

Source URL: www.boazbarak.org

Language: English - Date: 2012-09-24 16:01:00
    52J´erˆome Leroux  Least Significant Digit First Presburger Automata DRAFT. Please do not distribute, but contact the author for a version

    J´erˆome Leroux Least Significant Digit First Presburger Automata DRAFT. Please do not distribute, but contact the author for a version

    Add to Reading List

    Source URL: www.labri.fr

    Language: English - Date: 2014-03-17 06:03:51
    53Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

    Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

    Add to Reading List

    Source URL: www.usenix.org

    Language: English
    54Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch

    Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch

    Add to Reading List

    Source URL: fc15.ifca.ai

    Language: English - Date: 2015-01-11 00:32:58
    55Corrections for  Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen ASL Perspectives in Logic Series Cambridge University Press, 2010.

    Corrections for Logical Foundations of Proof Complexity Stephen Cook and Phuong Nguyen ASL Perspectives in Logic Series Cambridge University Press, 2010.

    Add to Reading List

    Source URL: www.cs.toronto.edu

    Language: English - Date: 2010-11-13 17:15:51
      56Learning	
  and	
  Explora/on	
  in	
   Automated	
  Theorem	
  Proving Moa	
  Johansson	
   Chalmers	
  University	
  of	
  Technology	
    	
  	
  

      Learning  and  Explora/on  in   Automated  Theorem  Proving Moa  Johansson   Chalmers  University  of  Technology      

      Add to Reading List

      Source URL: www.ai4fm.org

      Language: English - Date: 2015-09-02 07:29:35
      57On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

      On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

      Add to Reading List

      Source URL: www.complexity.ethz.ch

      Language: English - Date: 2012-03-28 07:53:42
      58On the Proof Complexity of Cut-Free Bounded Deep Inference Anupam Das University of Bath  Abstract. It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent sy

      On the Proof Complexity of Cut-Free Bounded Deep Inference Anupam Das University of Bath Abstract. It has recently been shown that cut-free deep inference systems exhibit an exponential speed-up over cut-free sequent sy

      Add to Reading List

      Source URL: www.anupamdas.com

      Language: English - Date: 2012-02-03 19:34:56
        592015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

        2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

        Add to Reading List

        Source URL: www.sigact.org

        Language: English - Date: 2015-05-26 18:25:25
        60Proof Complexity and Computational Complexity-Part II (命題論理証明の複雑さについて) 黒田 覚(群馬県立女子大学文学部総合教養学科(予定))  2008 年 9 月 18 日∼20 日

        Proof Complexity and Computational Complexity-Part II (命題論理証明の複雑さについて) 黒田 覚(群馬県立女子大学文学部総合教養学科(予定)) 2008 年 9 月 18 日∼20 日

        Add to Reading List

        Source URL: komoriyuichi.web.fc2.com

        Language: Japanese - Date: 2008-10-15 03:41:41